Implicit Divided Differences, Little Schröder Numbers, and Catalan Numbers
نویسنده
چکیده
Under general conditions, the equation g(x, y) = 0 implicitly defines y locally as a function of x. In this short note we study the combinatorial structure underlying a recently discovered formula for the divided differences of y expressed in terms of bivariate divided differences of g, by analyzing the number of terms an in this formula. The main result describes six equivalent characterizations of the sequence {an}.
منابع مشابه
Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled
We provide a new succession rule (i.e. generating tree) associated with Schröder numbers, that interpolates between the known succession rules for Catalan and Baxter numbers. We define Schröder and Baxter generalizations of parallelogram polyominoes (called slicings) which grow according to these succession rules. We also exhibit Schröder subclasses of Baxter classes, namely a Schröder subset o...
متن کاملDivided differences of inverse functions and partitions of a convex polygon
We derive a formula for an n-th order divided difference of the inverse of a function. The formula has a simple and surprising structure: it is a sum over partitions of a convex polygon with n+1 vertices. The formula provides a numerically stable method of computing divided differences of k-th roots. It also provides a new way of enumerating all partitions of a convex polygon of a certain type,...
متن کاملA Refinement of the Formula for k-ary Trees and the Gould-Vandermonde's Convolution
In this paper, we present an involution on some kind of colored k-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers Ck,γ(n) = γ kn+γ ( kn+γ n ) . From the combinatorial sum, we refine the formula for k-ary trees and obtain an implicit formula for the generating function of the generalized Catalan numbers which obviously implies a Van...
متن کاملCombinatoric Results for Graphical Enumeration and the Higher Catalan Numbers
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared recently as an auxiliary function in enumerating maps and explicit computations of the asymptotic expansion of the partition function of random matrices in the u...
متن کاملThe Super Patalan Numbers
We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analogous to those of the super Catalan numbers. The super Patalan numbers generalize the super Catalan numbers similarly to how the Patalan numbers generalize the Catalan numbers.
متن کامل